Bad Luck When Joining the Shortest Queue

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.Queueing;Join-the-shortest-queue;Probability of bad luck;Power-series algorithm;Overtaking customers;Dedicated customers

The power-series algorithm applied to cyclic polling systems

Polling Systems;Queueing Theory;operations research

The power-series algorithm applied to the shortest-queue model

Queueing Theory;operations research

Cyclic polling systems: Limited service versus Bernoulli schedules

Network Analysis;Polling Systems;miscellaneous issues

A numerical approach to cyclic-service queueing models

Queueing Theory;operations research